LP-type problem

Results: 20



#Item
1Graph theory / Mathematics / Geometry / Convex optimization / Operations research / Linear programming / Polytopes / Unique sink orientation / LP-type problem / Orientation / Simplex / Ear decomposition

Unique Sink Orientations of Grids ? Bernd G¨artner1 , Walter D. Morris, Jr.2 , and Leo R¨ ust3

Add to Reading List

Source URL: people.inf.ethz.ch

Language: English - Date: 2016-06-20 11:55:09
2Operations research / Foreign relations of Brazil / Foreign relations of India / Computational geometry / Linear programming / LP-type problem / Emo Welzl / Mathematical optimization / Bounding sphere / BRIC / Randomization

BRICS Basic Research in Computer Science BRICS NS-00-1 B. G¨artner: Randomization and Abstraction — Useful Tools for Optimization

Add to Reading List

Source URL: people.inf.ethz.ch

Language: English - Date: 2016-06-20 11:55:09
3Operations research / Linear programming / Convex optimization / Combinatorial optimization / Computational geometry / Bounding sphere / LP-type problem / Simplex algorithm / Time complexity / Mathematical optimization / Integer programming / Duality

50 LINEAR PROGRAMMING Martin Dyer, Bernd G¨artner, Nimrod Megiddo and Emo Welzl

Add to Reading List

Source URL: people.inf.ethz.ch

Language: English - Date: 2016-07-12 11:32:46
4Operations research / Linear programming / Convex optimization / Combinatorial optimization / Computational geometry / Bounding sphere / LP-type problem / Simplex algorithm / Time complexity / Mathematical optimization / Integer programming / Duality

50 LINEAR PROGRAMMING Martin Dyer, Bernd G¨artner, Nimrod Megiddo and Emo Welzl

Add to Reading List

Source URL: people.inf.ethz.ch

Language: English - Date: 2016-07-12 11:32:46
5Probabilistic complexity theory / Randomized algorithm / Permutation / Structure / LP-type problem / Mathematics / Theoretical computer science / Analysis of algorithms

A subexponential lower bound for the Random Facet algorithm for Parity Games Oliver Friedmann∗ Thomas Dueholm Hansen†

Add to Reading List

Source URL: files.oliverfriedmann.de

Language: English - Date: 2012-02-10 07:43:15
6Operations research / Linear programming / Simplex algorithm / Markov decision process / LP-type problem / Reinforcement learning / Algorithm / Simplex / SL / Mathematics / Applied mathematics / Geometry

Subexponential lower bounds for randomized pivoting rules for solving linear programs Oliver Friedmann ∗

Add to Reading List

Source URL: files.oliverfriedmann.de

Language: English - Date: 2012-02-10 07:43:14
7Applied mathematics / Convex optimization / Linear programming / Constraint / Candidate solution / Algorithm / Linear programming relaxation / LP-type problem / Mathematical optimization / Operations research / Mathematics

Solving online feasibility problem in constant amortized time per update Lilian Buzer∗† global shape of the pixels by minimizing an approximation error. But, using digital primitives we can build an exact approximati

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2005-07-31 13:55:46
8Computational complexity theory / Computational geometry / Linear programming / Analysis of algorithms / LP-type problem / Algorithm / Time complexity / Streaming algorithm / Minimum bounding box algorithms / Theoretical computer science / Applied mathematics / Mathematics

CCCG 2006, Kingston, Ontario, August 14–16, 2006 A Simple Streaming Algorithm for Minimum Enclosing Balls Hamid Zarrabi-Zadeh∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-27 22:59:03
9Science / Multi-objective optimization / Genetic algorithm / Interpolation / Algorithm / Heuristic function / Bilevel program / LP-type problem / Trajectory optimization / Mathematical optimization / Applied mathematics / Mathematics

A genetic algorithm for solving a class of multi-objective bilevel programming problems Shanfeng Zhang & Keqiang Li Department of Computer, ****** University, Guangzhou, 810008, China Abstract

Add to Reading List

Source URL: icaesee.org

Language: English
10Analysis of algorithms / Computational geometry / Probabilistic complexity theory / Randomized algorithm / Algorithm / Time complexity / Binary search algorithm / LP-type problem / Closest pair of points problem / Theoretical computer science / Applied mathematics / Mathematics

Faster Construction of Planar Two-centers David Eppstein∗ Abstract tical implementation. The method is complicated, and

Add to Reading List

Source URL: www.ics.uci.edu

Language: English - Date: 1997-12-08 20:38:05
UPDATE